Detecting perfect powers in essentially linear time
نویسنده
چکیده
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect power or proves that n is not a perfect power; (3) proves, using Loxton’s theorem on multiple linear forms in logarithms, that this perfect-power decomposition algorithm runs in time (log n)1+o(1).
منابع مشابه
Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers
This is the first in a series of papers whereby we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we give new improved bounds for linear forms in three logarithms. We also apply a combination of classical techniques with ...
متن کاملSparse Perfect Powers
We examine the problem of detecting when a given sparse polynomial f is equal to hr for some other polynomial h and integer r ≥ 2. In this case we say f is a perfect power, and h is its r th root. We give randomized algorithms to detect when f is a perfect power, by repeatedly evaluating the polynomial in specially-chosen finite fields and checking whether the evaluations are themselves perfect...
متن کاملFactoring into coprimes in essentially linear time
Let S be a finite set of positive integers. A “coprime base for S” means a set P of positive integers such that (1) each element of P is coprime to every other element of P and (2) each element of S is a product of powers of elements of P. There is a natural coprime base for S. This paper introduces an algorithm that computes the natural coprime base for S in essentially linear time. The best p...
متن کاملPerfect Powers with Few Binary Digits and Related Diophantine Problems
We prove that, for any fixed base x ≥ 2 and sufficiently large prime q, no perfect q-th powers can be written with 3 or 4 digits 1 in base x. This is a particular instance of rather more general results, whose proofs follow from a combination of refined lower bounds for linear forms in Archimedean and non-Archimedean logarithms.
متن کاملDifferences between Perfect Powers
We apply the hypergeometric method of Thue and Siegel to prove, if a and b are positive integers, that the inequality 0 < |a − b | < 1 4 max{a, b} has at most a single solution in positive integers x and y. This essentially sharpens a classic result of LeVeque.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 67 شماره
صفحات -
تاریخ انتشار 1998